Informed expansion for informative path planning via online distribution learning

نویسندگان

چکیده

Mobile robots are essential tools for gathering knowledge of the environment and monitoring areas interest as well industrial assets. Informative Path Planning methodologies have been successfully applied making able to autonomously acquire information explore unknown surroundings. Rapidly-exploring Information Gathering approaches validated in real-world applications, proving they way go when aiming tasks. In fact, RIG can plan paths with several degrees freedom rapidly complex workspaces by using state-of-the-art Voronoi-biased expansion. Nevertheless, it is an efficient solution most area but its effectiveness decreases exploration/gathering evolves. This paper introduces innovative informed expansion IG tasks that combines Kernel Density Estimation technique a rejection sampling algorithm. By learning online distribution acquired (i.e., discovered map), proposed methodology generates samples unexplored regions workspace, thus steers tree toward promising areas. Realistic simulations experimental campaign, conducted underwater robotics domain, provide proof-of-concept validation developed demonstrate enhances performance

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Informative Path Planning for Active Classification on UAVs

We propose an informative path planning (IPP) algorithm for active classification using an unmanned aerial vehicle (UAV), focusing on weed detection in precision agriculture. We model the presence of weeds on farmland using an occupancy grid and generate plans according to information-theoretic objectives, enabling the UAV to gather data efficiently. We use a combination of global viewpoint sel...

متن کامل

Informed Sampling for Asymptotically Optimal Path Planning

Anytime almost-surely asymptotically optimal planners, such as RRT*, incrementally find paths to every state in the search domain. This is inefficient once an initial solution is found as then only states that can provide a better solution need to be considered. Exact knowledge of these states requires solving the problem but can be approximated with heuristics. This paper formally defines thes...

متن کامل

Adaptive Informative Path Planning in Metric Spaces

In contrast to classic geometric motion planning, informative path planning (IPP) seeks a path for a robot to sense the world and gain information. In adaptive IPP, the robot chooses the next sensing location conditioned on all information acquired so far, and the robot’s goal is to minimize the travel cost required for identifying a true hypothesis. Adaptive IPP is NP-hard, because the robot m...

متن کامل

Subdimensional expansion for multirobot path planning

Planning optimal paths for large numbers of robots is computationally expensive. In this paper, we introduce a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded i...

متن کامل

Informative Path Planning and Sensor Scheduling for Persistent Monitoring Tasks

In this thesis we consider two combinatorial optimization problems that relate to the field of persistent monitoring. In the first part, we extend the classic problem of finding the maximum weight Hamiltonian cycle in a graph to the case where the objective is a submodular function of the edges. We consider a greedy algorithm and a 2-matching based algorithm, and we show that they have approxim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Robotics and Autonomous Systems

سال: 2023

ISSN: ['0921-8890', '1872-793X']

DOI: https://doi.org/10.1016/j.robot.2023.104449